Experiments on the Core: Some Disconcerting Results for Majority Rule Voting Games

نویسندگان

  • RICHARD D. McKELVEY
  • PETER C. ORDESHOOK
چکیده

In the context of spatial majority voting games, considerable experimental support exists for the core as a solution hypothesis when it is not empty (Berl et al., 1976; Fiorina and Plott, 1978; Isaacs and Plott, 1978). Specifically, these experiments show that if a simple majority voting game possesses a Core point-a point that cannot be defeated by a majority vote-subjects choose outcomes at or near this point. In this article, however, we present some additional experimental evidence to suggest that committee choice in simple majority rule games is not dictated solely by whether or not the core is nonempty. We conclude that, in the experimental context of open and free discussion, the performance of the core may be affected by the structure of the alternative space, and by factors that seem irrelevant to the theory, such as the structure of the dominance relation underlying the core in the social ordering.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

Voting Power in the Council of the European Union under the Nice rules

We provide a new method to compute the Banzhaf power index for weighted voting games as well as weighted double and triple majority games. We calculate the Banzhaf index in an exact way by generating functions, with a signi...cant decrease in the computational complexity. Moreover, the Banzhaf indices are calculated for the decision rules approved in the Nice summit meeting, which will be used ...

متن کامل

An Effective and Optimal Fusion Rule in the Presence of Probabilistic Spectrum Sensing Data Falsification Attack

Cognitive radio (CR) network is an excellent solution to the spectrum scarcity problem. Cooperative spectrum sensing (CSS) has been widely used to precisely detect of primary user (PU) signals. The trustworthiness of the CSS is vulnerable to spectrum sensing data falsification (SSDF) attack. In an SSDF attack, some malicious users intentionally report wrong sensing results to cheat the fusion c...

متن کامل

A Social Choice Lemma on Voting Over Lotteries with Applications to a Class of Dynamic Games

We prove a lemma characterizing majority preferences over lotteries on a subset of Euclidean space. Assuming voters have quadratic von NeumannMorgenstern utility representations, and assuming existence of a majority undominated (or “core”) point, the core voter is decisive: one lottery is majority-preferred to another if and only if this is the preference of the core voter. Several applications...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017